Essential sequences

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Essential role of cyclization sequences in flavivirus RNA replication.

A possible role in RNA replication for interactions between conserved complementary (cyclization) sequences in the 5'- and 3'-terminal regions of Flavivirus RNA was previously suggested but never tested in vivo. Using the M-fold program for RNA secondary-structure predictions, we examined for the first time the base-pairing interactions between the covalently linked 5' genomic region (first ~16...

متن کامل

Gene expression in Leishmania: analysis of essential 5' DNA sequences.

A major unanswered question in Kinetoplastida parasites is the mechanism of regulating gene expression. Using a transfection system, we have previously shown that the intergenic region of the alpha-tubulin gene of Leishmania enriettii contained sequences required for gene expression. The goal of the work reported here was to determine whether the Leishmania-derived sequences were providing tran...

متن کامل

Exploring Essential Attributes for Detecting MicroRNA Precursors from Background Sequences

MicroRNAs (miRNAs) have been shown to play important roles in post-transcriptional gene regulation. The hairpin structure is a key characteristic of the microRNAs precursors (pre-miRNAs). How to encode their hairpin structures is a critical step to correctly detect the pre-miRNAs from background sequences, i.e., pseudo miRNA precursors. In this paper, we have proposed to encode the hairpin stru...

متن کامل

Toeplitz transforms of Fibonacci sequences

We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.

متن کامل

On Runs in Independent Sequences

Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1985

ISSN: 0021-8693

DOI: 10.1016/0021-8693(85)90102-4